Three Selfish Spanning Tree Games
نویسندگان
چکیده
We study a problem in a network. The input is an edgeweighted graph G = (V, E) such that V contains a specific source node r. Every v ∈ V \{r} is an entity which wants to be connected to r either directly or via other entities. The main question is how do the entities deviate from a socially optimal network if they are not monitored by a central authority. We provide theoretical bounds on the (strong) price of anarchy of this game. In particular, three variants – each of them being motivated by a practical situation – are studied.
منابع مشابه
A modified position value for communication situations and its fuzzification
Myerson treated various situations of cooperation in the field of cooperative games and proposed the communication structure. In this paper, we define and characterize an allocation rule in terms of the position value, called an average spanning tree solution, for communication situations by introducing a concept of cooperation relationship which says that two players are deemed to possess this...
متن کاملCost monotonicity, consistency and minimum cost spanning tree games
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core selection and also satis...es cost monotonicity. We also give characterization theorems for the new rule as well as the much-studied Bird allocation. We show that the principal di¤erence between these two rules is in terms of their consistency properties. JEL Classi...cation Numbers: D7
متن کاملSubmodularity of minimum-cost spanning tree games
We give a necessary condition and a sufficient condition for a minimum-cost spanning tree game introduced by Bird to be submodular (or convex). When the cost is restricted to two values, we give a characterization of submodular minimum-cost spanning tree games. We also discuss algorithmic issues.
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملReduction of Ultrametric Minimum Cost Spanning Tree Games to Cost Allocation Games on Rooted Trees
A minimum cost spanning tree game is called ultrametric if the cost function on the edges of the underlying network is an ultrametric. We show that every ultrametric minimum cost spanning tree game is reduced to a cost allocation game on a rooted tree. It follows that there exist O(n) time algorithms for computing the Shapley value, the nucleolus and the egalitarian allocation of the ultrametri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008